Self-similar breakup of near-inviscid liquids

The final stages of pinchoff and breakup of dripping droplets of near-inviscid Newtonian fluids are studied experimentally for pure water and ethanol. High-speed imaging and image analysis are used to determine the angle and the minimum neck size of the cone-shaped extrema of the ligaments attached to dripping droplets in the final microseconds before pinchoff. The angle is shown to steadily approach the value of 18.0 ±0.4, independently of the initial flow conditions or the type of breakup. The filament thins and necks following a τ2 /3 law in terms of the time remaining until pinchoff, regardless of the initial conditions. The observed behavior confirms theoretical predictions. © 2012 American Physical Society.

Self-similar breakup of near-inviscid liquids.

The final stages of pinchoff and breakup of dripping droplets of near-inviscid Newtonian fluids are studied experimentally for pure water and ethanol. High-speed imaging and image analysis are used to determine the angle and the minimum neck size of the cone-shaped extrema of the ligaments attached to dripping droplets in the final microseconds before pinchoff. The angle is shown to steadily approach the value of 18.0 ± 0.4°, independently of the initial flow conditions or the type of breakup. The filament thins and necks following a τ(2/3) law in terms of the time remaining until pinchoff, regardless of the initial conditions. The observed behavior confirms theoretical predictions.

Consensus optimization on manifolds

The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e., maximizing the consensus) or balance (i.e., minimizing the consensus) the agents; a convenient adaptation of the gradient algorithms is used when the communication graph is directed and time-varying. The cost function is linked to a specific centroid definition on manifolds, introduced here as the induced arithmetic mean, that is easily computable in closed form and may be of independent interest for a number of manifolds. The special orthogonal group SO (n) and the Grassmann manifold Grass (p, n) are treated as original examples. A link is also drawn with the many existing results on the circle. © 2009 Society for Industrial and Applied Mathematics.